Scheduling rooted forests with communication delays
نویسندگان
چکیده
منابع مشابه
Scheduling with Communication Delays
More and more parallel and distributed systems (cluster, grid and global computing) are both becoming available all over the world, and opening new perspectives for developers of a large range of applications including data mining, multimedia, and bio-computing. However, this very large potential of computing power remains largely unexploited this being, mainly due to the lack of adequate and e...
متن کاملTree Scheduling with Communication Delays
This paper considers the problem of scheduling a tree-structured task system in a distributed environment with the goal of minimizing the makespan. Interprocessor communication delays are taken into account and task duplication is allowed. Furthermore, it is assumed that the number of processors is unlimited. It is shown that there is a polynomial-time algorithm for an outtree and that the intr...
متن کاملMultiprocessor scheduling with communication delays
Acknowledgements The work presented here has been carried out at the CWI in Amsterdam as part of the ScheduLink subproject within the Par Tool project. The ParTool project is partially supported by SPIN, a Dutch computer science stimulation program. I am truly grateful to my supervisor, Jan Karel Lenstra, and my other co-authors, Han Hoogeveen, Ben Lageweg, Steef van de Velde en Marinus Veldhor...
متن کاملScheduling Trees with Communication Delays
Several variants of scheduling task graphs with interprocessor communication delays have been shown to be NP-complete. This paper completely characterizes the complexity of this problem under the restriction that the task graphs are trees and that each task has unit execution time. It is shown that the problem remains NP-complete for binary trees with uniform communication delays. The same hold...
متن کاملParallel Machine Scheduling with Uncertain Communication Delays
This paper is concerned with scheduling when the data are not fully known before the execution. In that case computing a complete schedule off-line with estimated data may lead to poor performances. Some flexibility must be added to the scheduling process. We propose to start from a partial schedule and to postpone the complete scheduling until execution, thus introducing what we call a stabili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Order
سال: 1994
ISSN: 0167-8094,1572-9273
DOI: 10.1007/bf01108764